next
Round
Technologies
Coding Problems
Bookmarks
Learning Paths
next
Round
Technologies
Coding Problems
Bookmarks
Learning Paths
1
What is the Two-Pointer technique? Give a use case.
Beginner
2
Why are Strings immutable in Java/C#? What are the benefits?
Intermediate
3
What is a Dynamic Array (ArrayList/Vector)? How does it grow?
Intermediate
4
Why is string concatenation in a loop O(n²)? How do you fix it? (StringBuilder)
Intermediate
5
Explain the concept of Amortized O(1) for Dynamic Array insertion.
Intermediate
6
Explain Kadane's Algorithm (Maximum Subarray Sum). What is its complexity?
Intermediate
7
How do you rotate an array by k positions? (In-place vs extra space)
Beginner
8
What is the difference between a String and a Character Array?
Intermediate
9
Why is accessing an array element O(1)?
Beginner
10
How do you check if two strings are anagrams of each other?
Beginner
11
Explain how to find the longest palindromic substring.
Intermediate
12
Why is insertion/deletion in the middle of an array O(n)?
Beginner
13
What is an Array? How is it stored in memory?
Beginner
14
What is the Sliding Window technique? Give a use case.
Intermediate
15
What are the advantages and disadvantages of Arrays?
Intermediate
16
What is String Interning?
Intermediate
17
How do you find the second largest element in an unsorted array?
Beginner
18
What is a Sparse Array? When is it useful?
Intermediate
19
What is the Prefix Sum technique?
Intermediate
All Topics
1
Foundations
0/2 topics · 0%
Basics
Complexity Analysis
2
Linear structures
0/4 topics · 0%
Arrays and Strings
Linked Lists
Stacks and Queues
Hash Tables
3
Non-Linear structures
0/2 topics · 0%
Trees
Graphs
Share
this topic
Share via WhatsApp, X, Facebook, LinkedIn or copy link. Open Graph preview enabled.